Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Kyungjin Cho and Eunjin Oh. Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 46:1-46:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{cho_et_al:LIPIcs.ISAAC.2021.46, author = {Cho, Kyungjin and Oh, Eunjin}, title = {{Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {46:1--46:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.46}, URN = {urn:nbn:de:0030-drops-154794}, doi = {10.4230/LIPIcs.ISAAC.2021.46}, annote = {Keywords: k-means clustering, affine subspaces} }
Feedback for Dagstuhl Publishing